On $\star$-associated comonotone functions
نویسندگان
چکیده
منابع مشابه
Nearly Comonotone Approximation
We discuss the degree of approximation by polynomials of a function f that is piecewise monotone in ?1; 1]. We would like to approximate f by polynomials which are comonotone with it. We show that by relaxing the requirement for comonotonicity in small neighborhoods of the points where changes in monotonicity occur and near the endpoints, we can achieve a higher degree of approximation. We show...
متن کاملSemi-Star-Alpha-Open Sets and Associated Functions
The aim of this paper is to introduce various functions associated with semi*α-open sets. Here semi*αcontinuous, semi*α-irresolute, contra-semi*α-continuous and contra-semi*α-irresolute functions are defined. Characterizations for these functions are given. Further their fundamental properties are investigated. Many other functions associated with semi*α-open sets and their contra versions are ...
متن کاملNearly Comonotone Approximation Ii
When we approximate a continuous function f which changes its monotonicity nitely many, say s times, in ?1; 1], we wish sometimes that the approximating polynomials follow these changes in monotonicity. However, it is well known that this requirement restricts very much the degree of approximation that the polynomials can achieve, namely, only the rate of ! 2 (f; 1=n) and even this not with a c...
متن کاملA Subclass of Analytic Functions Associated with Hypergeometric Functions
In the present paper, we have established sufficient conditions for Gaus-sian hypergeometric functions to be in certain subclass of analytic univalent functions in the unit disc $mathcal{U}$. Furthermore, we investigate several mapping properties of Hohlov linear operator for this subclass and also examined an integral operator acting on hypergeometric functions.
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2018
ISSN: 0023-5954,1805-949X
DOI: 10.14736/kyb-2018-2-0268